Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
نویسندگان
چکیده
منابع مشابه
Information-theoretic Limits for Community Detection in Network Models
We analyze the information-theoretic limits for the recovery of node labels in several network models, including the stochastic block model, as well as the latent space model. For the stochastic block model, the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities. For the latent space model, the non-recoverability condi...
متن کاملOn the Information Theoretic Limits of Learning Ising Models
We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d. samples. While there have been recent results for specific graph classes, these involve fairly extensive technical arguments that are specialized to each specific graph class. In contrast, we isolate two key graph-structural ingredients that can th...
متن کاملGraphical Decision-Theoretic Models on the Web
The principles of decision-analytic decision support, implemented in GeNIe (Graphical Network Interface) and SMILE (Structural Modeling, Inference, and Learning Engine) can be applied in practical decision support systems (DSSs). GeNIe plays the role of a developer's environment and SMILE plays the role of the reasoning engine. A decision support system based on SMILE can be equipped with a ded...
متن کاملInformation - Theoretic Limits for Density Estimation
This paper is concerned with the information-theoretical limits of density estimation for Gaussian random variables with data drawn independently and with identical distributions. We apply Fano’s inequality to the space of densities and an arbitrary estimator. We derive necessary conditions on the sample size for reliable density recovery and for reliable density estimation. These conditions ar...
متن کاملMaking Pairwise Binary Graphical Models Attractive
Computing the partition function (i.e., the normalizing constant) of a given pairwise binary graphical model is NP-hard in general. As a result, the partition function is typically estimated by approximate inference algorithms such as belief propagation (BP) and tree-reweighted belief propagation (TRBP). The former provides reasonable estimates in practice but has convergence issues. The later ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2191659